#include "binary_tree.h"
#include "queue.h"

int main()
{
	char* a = "abcdefghi";
	int length = strlen(a);
	binary_tree_node* root = binary_tree_create(0, a, length);
	//binary_tree_node* root = create_binary_tree();

	//pre_order(root);
	//printf("\n");
	// 
	//in_order(root);
	//printf("\n");
	// 
	//post_order(root);
	//printf("\n");
	// 
	//int size_one = 0;
	//binary_tree_size_one(root, &size_one);
	//printf("%d \n", size_one);
	
	//int size_two = 0;
	//printf("%d \n", binary_tree_size_two(root));

	//int leaf_size = 0;
	//leaf_size = binary_tree_leaf_size(root);
	//printf("%d ", leaf_size);

	//int k = 3;
	//int level_k_size = binary_tree_level_k_size(root, k);
	//printf("%d ", level_k_size);

	//int tree_depth = binary_tree_depth(root);
	//printf("%d ", tree_depth);

	//binary_tree_node* find_node = binary_tree_find(root, 'E');
	//assert(find_node);
	//printf("%c ", find_node->data);

	//binary_tree_level_order(root);

	bool ret = binary_tree_complete(root);
	printf("%d ", ret);
		
	binary_tree_destroy(root);
	root = NULL;
	return 0;
}